Further Results on Capacitated Network Design Games
نویسندگان
چکیده
In a capacitated network design game, each of n players selects a path from her source to her sink. The cost of each edge is shared equally among the players using the edge. Every edge has a finite capacity that limits the number of players using the edge. We study the price of stability for such games with respect to the max-cost objective, i.e., the maximum cost paid by any player. We show that the price of stability is O(n) for symmetric games, and this bound is tight. Furthermore, we show that the price of stability for asymmetric games can be Ω(n logn), matching the previously known upper bound. We also prove that the convergence time of best response dynamics cannot be bounded by any function of n.
منابع مشابه
A Simulated Annealing Algorithm for Unsplittable Capacitated Network Design
The Network Design Problem (NDP) is one of the important problems in combinatorial optimization. Among the network design problems, the Multicommodity Capacitated Network Design (MCND) problem has numerous applications in transportation, logistics, telecommunication, and production systems. The MCND problems with splittable flow variables are NP-hard, which means they require exponential time t...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملDesign of a Bi-Objective Capacitated Single-Allocation Incomplete Hub Network Considering an Elastic Demand
This paper presents a bi-objective capacitated hub arc location problem with single assignment for designing a metro network with an elastic demand. In the literature, it is widely supposed that the network created with the hub nodes is complete. In this paper, this assumption is relaxed. Moreover, in most hub location problems, the demand is assumed to be static and independent of the location...
متن کاملReliable Designing of Capacitated Logistics Network with Multi Configuration Structure under Disruptions: A Hybrid Heuristic Based Sample Average Approximation Algorithm
We consider the reliable multi configuration capacitated logistics network design problem (RMCLNDP) with system disruptions, concerned with facilities locating, transportation links constructing, and also allocating their limited capacities to the customers in order to satisfy their demands with a minimum expected total cost (including locating costs, link constructing costs, as well as expecte...
متن کاملA fuzzy capacitated facility location-network design model: A hybrid firefly and invasive weed optimization (FIWO) solution
Facility location-network design (FLND) problem, which determines the location of facilities and also communication links between the demand and facility nodes, is arisen from the combination of the facility location and network design problems. This paper deals with fuzzy capacitated facility location-network design model which aims to select the facilities and candidate links in a way that yi...
متن کامل